The generalized 4-connectivity of hypercubes
نویسندگان
چکیده
منابع مشابه
Mixing of Quantum Walks on Generalized Hypercubes
We study continuous-time quantum walks on graphs which generalize the hypercube. The only known family of graphs whose quantum walk instantaneously mixes to uniform is the Hamming graphs with small arities. We show that quantum uniform mixing on the hypercube is robust under the addition of perfect matchings but not much else. Our specific results include: • The graph obtained by augmenting the...
متن کاملOn generalized atom-bond connectivity index of cacti
The generalized atom-bond connectivity index of a graph G is denoted by ABCa(G) and defined as the sum of weights ((d(u)+d(v)-2)/d(u)d(v))aa$ over all edges uv∊G. A cactus is a graph in which any two cycles have at most one common vertex. In this paper, we compute sharp bounds for ABCa index for cacti of order $n$ ...
متن کاملGeneralized Connectivity ∗
In this paper, we introduce generalized connectivity in L-fuzzy topological spaces by à Lukasiewicz logic and prove K. Fan’s theorem.
متن کاملImproved Probabilistic Routing on Generalized Hypercubes
p. 1 Efficient Data Communication in Incomplete Hypercubes p. 13 Efficient Communication in the Folded Petersen Interconnection Networks p. 25 Compiling Rewriting onto SIMD and MIMD/SIMD Machines p. 37 A Compilation Technique for Varying Communication Cost NUMA Architectures p. 49 A Data Partitioning Algorithm for Distributed Memory Compilation p. 61 Towards a High Precision Massively Parallel ...
متن کاملHamiltonian-connectivity and strongly Hamiltonian-laceability of folded hypercubes
In this paper, we analyze a hypercube-like structure, called the folded hypercube, which is basically a standard hypercube with some extra links established between its nodes. We first show that the n-dimensional folded hypercube is bipartite when n is odd.We also show that the n-dimensional folded hypercube is strongly Hamiltonian-laceable when n is odd, and is Hamiltonian-connected when n = 1...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2017
ISSN: 0166-218X
DOI: 10.1016/j.dam.2016.12.003